#include "Sort.h"
#include "Stack.h"

void TestInsertSort()
{
	int arr[10] = { 5, 1, 8, 7, 3, 9, 2, 0, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	InsertSort(arr, 10);
	PrintArray(arr, 10);
}
void TestBubbleSort()
{
	int arr[10] = { 5, 1, 8, 7, 3, 9, 2, 0, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	BubbleSort(arr, 10);
	PrintArray(arr, 10);
}
void TestShellSort()
{
	int arr[10] = { 5, 1, 8, 7, 3, 9, 2, 0, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	ShellSort(arr, 10);
	PrintArray(arr, 10);
}

void TestSelectSort()
{
	int arr[10] = { 5, 1, 8, 7, 3, 9, 2, 0, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	SelectSort(arr, 10);
	PrintArray(arr, 10);
}

void TestHeapSort()
{
	int arr[10] = { 5, 1, 8, 7, 3, 9, 2, 0, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	HeapSort(arr, sz);
	PrintArray(arr, 10);
}

void TestQuickSort1()
{
	int arr[10] = { 5, 1, 8, 7, 3, 9, 2, 0, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	QuickSort1(arr, 0, sz - 1);
	PrintArray(arr, 10);
}
void TestQuickSort2()
{
	int arr[10] = { 5, 1, 8, 7, 3, 9, 2, 0, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	QuickSort2(arr, 0, sz - 1);
	PrintArray(arr, 10);
}
void TestQuickSort3()
{
	int arr[10] = { 5, 1, 8, 7, 3, 9, 2, 0, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	QuickSort3(arr, 0, sz - 1);
	PrintArray(arr, 10);
}

void TestQuickSortNonR()
{
	int arr[10] = { 5, 1, 8, 7, 3, 9, 2, 0, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	QuickSortNonR(arr, 0, sz - 1);
	PrintArray(arr, 10);
}
void TestMergeSort()
{
	int arr[10] = { 5, 1, 8, 7, 3, 9, 2, 0, 4, 6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	MergeSort(arr, sz);
	PrintArray(arr, 10);

}
int main()
{
	//TestInsertSort();
	//TestBubbleSort();
	//TestShellSort();
	//TestSelectSort();
	TestHeapSort();
	//TestQuickSort1();
	//TestQuickSort2();
	//TestQuickSort3();
	//TestQuickSortNonR();
	//TestMergeSort();
	return 0;
}